Tropical linear-fractional programming and parametric mean payoff games

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tropical linear-fractional programming and parametric mean payoff games

Tropical polyhedra have been recently used to represent disjunctive invariants in static analysis. To handle larger instances, tropical analogues of classical linear programming results need to be developed. This motivation leads us to study the tropical analogue of the classical linear-fractional programming problem. We construct an associated parametric mean payoff game problem, and show that...

متن کامل

Tropical linear programming and parametric mean payoff games

Tropical polyhedra have been recently used to represent disjunctive invariants in static analysis. To handle larger instances, the tropical analogues of classical linear programming results need to be developed. This motivation leads us to study a general tropical linear programming problem. We construct an associated parametric mean payoff game problem, and show that the optimality of a given ...

متن کامل

Mean-payoff Games and Parametric Tropical Two-sided Systems

We propose a general theory of parametric two-sided tropical linear systems based on the connections with zero-sum deterministic mean-payoff games. It is shown how this general theory specializes to particular tropical linear systems with parameter, arising from 1) the two-sided tropical eigenproblem Ax = λ+Bx and 2) the tropical linear programming. This involves 1) the problem of finding the s...

متن کامل

Linear Programming Polytope and Algorithm for Mean Payoff Games

We investigate LP-polytopes generated by mean payoff games and their properties, including the existence of tight feasible solutions of bounded size. We suggest a new associated algorithm solving a linear program and transforming its solution into a solution of the game.

متن کامل

Mean Payoff Games and Linear Complementarity

We suggest new pseudopolynomial and subexponential algorithms for Mean Payoff Games (MPGs). The algorithms are based on representing the MPG decision problem in the forms of non-standard and standard Linear Complementarity Problems (LCPs): find w, z ≥ 0 satisfying w = Mz + q and w · z = 0, (1.1) and monotonic iterative propagation of slack updates.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2012

ISSN: 0747-7171

DOI: 10.1016/j.jsc.2011.12.049